Conference on : Decision and Control , Dec . 1996 , Kobe , JapanOptimal Finite State Supervisory

نویسنده

  • Enrico Tronci
چکیده

Supervisory Controllers are Discrete Event Dynamic Systems (DEDSs) forming the discrete core of a Hybrid Control System. We address the problem of automatic synthesis of Optimal Finite State Supervisory Controllers (OSCs). We show that Boolean First Order Logic (BFOL) and Binary Decision Diagrams (BDDs) are an eeective meth-odological and practical framework for Optimal Finite State Supervisory Control. Using BFOL programs (i.e. systems of boolean functional equations) and BDDs we give a symbolic (i.e. BDD based) algorithm for automatic synthesis of OSCs. Our OSC synthesis algorithm can handle arbitrary sets of nal states as well as plant transition relations containing loops and uncontrollable events (e.g. failures). We report on experimental results on the use of our OSC synthesis algorithm to synthesize a C program implementing a minimum fuel OSC for two autonomous vehicles moving on a 44 grid.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Finite State Supervisory Control

Supervisory Controllers are Discrete Event Dynamic Systems (DEDSs) forming the discrete core of a Hybrid Control System. We address the problem of automatic synthesis of Optimal Finite State Supervisory Controllers (OSCs). We show that Boolean First Order Logic (BFOL) and Binary Decision Diagrams (BDDs) are an eeective meth-odological and practical framework for Optimal Finite State Supervisory...

متن کامل

Recent Results on Computational Issues in Supervisory Control

We present and discuss the implications of recent results by several researchers on computational issues in supervisory control of discrete event systems. The first issue discussed is the boundary between decidability and undecidability in centralized and decentralized control problems for systems modeled by finite-state automata and subject to regular language specifications. The second issue ...

متن کامل

On Petri Net Models of Infinite State Supervisors

We consider a class of supervisory control problems that require infinite state supervisors and introduce Petri nets with inhibitor arcs (PN's) to model the supervisors. We compare this PN-based approach to supervisory control to automata-based approaches. The primary advantage of a PN-based supervisory controller is that a PN-based controller provides a finite representation of an infinite sta...

متن کامل

Periodic Finite State Controllers for Efficient POMDP and DEC-POMDP Planning

Applications such as robot control and wireless communication require planning under uncertainty. Partially observable Markov decision processes (POMDPs) plan policies for single agents under uncertainty and their decentralized versions (DEC-POMDPs) find a policy for multiple agents. The policy in infinite-horizon POMDP and DEC-POMDP problems has been represented as finite state controllers (FS...

متن کامل

Instructing a Reinforcement Learner

In reinforcement learning (RL), rewards have been considered the most important feedback in understanding the environment. However, recently there have been interesting forays into other modes such as using sporadic supervisory inputs. This brings into the learning process richer information about the world of interest. In this paper, we model these supervisory inputs as specific types of instr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996